Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
نویسنده
چکیده
We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.
منابع مشابه
Finite Generation and Presentability of Wreath Products of Monoids
This paper gives necessary and sufficient conditions for the restricted wreath product of two monoids to be finitely generated or finitely presented.
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملAlgebraic characterization of logically defined tree languages
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindström quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization relies on the usage of preclones, an algebraic structure introduced by the authors in a previous paper, and of the block product operation on preclones. Our re...
متن کاملRegular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
متن کاملEF+EX Forest Algebras
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs...
متن کامل